Computability of Self-Similar Sets
نویسندگان
چکیده
We investigate computability of a self-similar set on a Euclidean space. A nonempty compact subset of a Euclidean space is called a self-similar set if it equals to the union of the images of itself by some set of contractions. The main result in this paper is that if all of the contractions are computable, then the self-similar is a recursive compact set. A further result on the case that the self-similar set forms a curve is also discussed.
منابع مشابه
Computability of Koch Curve and Koch Island
Koch curve is known as a typical self-similar set on Euclidean plane. Koch island is a closed set surrounded by three copies of Koch curve. We investigate them from the viewpoint of computability. In this paper, we define computability of a curve and that of a closed set as an application of classical computable analisys to Euclidean spaces and show that Koch curve is a computable curve and bot...
متن کاملComputability of the Hausdorff and packing measures on self-similar sets and the self-similar tiling principle
We state a self-similar tiling principle which shows that any open subset of a self-similar set with open set condition may be tiled without loss of measure by copies under similitudes of any closed subset with positive measure. We use this method to get the optimal coverings and packings which give the exact value of the Hausdorff-type and packing measures. In particular, we show that the exac...
متن کاملDefinability, automorphisms, and dynamic properties of computably enumerable sets
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of FelixKlein’sErlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and theMartin Invariance Conjecture on their Tur...
متن کاملSub-computabilities
Every recursively enumerable set of integers (r.e. set) is enumerable by a primitive recursive function. But if the enumeration is required to be one-one, only a proper subset of all r.e. sets qualify. Starting from a collection of total recursive functions containing the primitive recursive functions, we thus define a sub-computability as an enumeration of the r.e. sets that are themselves one...
متن کاملDeenability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
We announce and explain recent results on the computably enu-merable (c.e.) sets, especially their deenability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of Felix Klein's Erlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and the Martin Invariance Conjecture on their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 45 شماره
صفحات -
تاریخ انتشار 1999